Interweaving Real-Time Jobs with Energy Harvesting to Maximize Throughput

Motivated by baterryless IoT devices, we consider the following scheduling problem. The input includes n unit time jobs $$\mathcal {J}= \left\{ J_1, \ldots , J_n \right\} $$ where each job $$J_i$$ has a release $$r_i$$ due date $$d_i$$ energy requirement $$e_i$$ and weight $$w_i$$ . We to be slotted; hence, all related values refer slots. Let $$T=\max _i\left\{ d_i also an $$h_t$$ value for every slot t $$\left( 1 \le T \right) which is harvestable on that slot. Energy harvested at slots when no executed. objective find feasible schedule maximizes of scheduled jobs. A if $$J_j$$ in its corresponding $$t_j$$ $$t_{j} \ne t_{j'}$$ $${j} {j'}$$ $$r_j t_j d_j$$ available before least $$e_j$$ To best our knowledge, are first theoretical aspects this In work show following. (1) polynomial algorithm have identical $$r_i, d_i$$ (2) $$\frac{1}{2}$$ -approximation but arbitrary (3) An FPTAS (4) Reductions showing variants problem one attributes or not $$\textsf {NP\text {-}Hard}$$